Approximation Algorithm of Minimizing Makespan in Parallel Bounded Batch Scheduling∗
نویسندگان
چکیده
We consider the problem of minimizing the makespan(Cmax) on m identical parallel batch processing machines. The batch processing machine can process up to B jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time. For a batch of jobs, the processing time of the batch is equal to the largest processing time among the jobs in the batch. In this paper, we design a fully polynomial time approximation scheme (FPTAS) to solve the bounded identical parallel batch scheduling problem Pm|B < n|Cmax when the number of identical parallel batch processing machines m is constant.
منابع مشابه
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
The problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed, is considered. The standard problem of minimizing the makespan of the schedule (SUM) and the bicriteria problem of scheduling with bounded makespan and cost (SUMC) are addressed, and randomized fully linear time approximation schemes are shown for both of them. While matching the...
متن کاملNew Formulation and Solution in PCB Assembly Systems with Parallel Batch processors
This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...
متن کاملApproximation of the parallel machine scheduling problem with additional unit resources
We consider the problem of minimizing the makespan of a schedule on m parallel machines of n jobs, where each job requires exactly one of s additional unit resources. This problem collapses to P ||Cmax if every job requires a different resource. It is therefore NP-hard even if we fix the number of machines to 2 and strongly NP-hard in general. Although very basic, its approximability is not kno...
متن کاملMakespan Minimization on Parallel Batch Processing Machines with Release Times and Job Sizes
This paper investigates the scheduling problem of minimizing makespan on parallel batch processing machines encountered in different manufacturing environments, such as the burn-in operation in the manufacture of semiconductors and the aging test operation in the manufacture of thin film transistor-liquid crystal displays (TFT-LCDs). Each job is characterized by a processing time, a release tim...
متن کاملThe bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
We consider the problem of scheduling family jobs with release dates on a bounded batching machine. Our objective is to minimize the maximum completion time of the jobs (i.e., the makespan). We deal with two variants of the problem. One is the identical job size model, in which the machine can process up to b jobs simultaneously as a batch. The other is the non-identical job size model, in whic...
متن کامل